Complexity of Curves
نویسنده
چکیده
We show that each of the classes of hereditarily locally connected, finitely Suslinian, and Suslinian continua is Π1-complete, while the class of regular continua is Π4-complete.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملTime Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves
This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...
متن کاملCapturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division
In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...
متن کاملFast Arithmetic In Jacobian Of Hyperelliptic Curves Of Genus 2 Over GF(p)
In this paper, we suggest a new fast transformation for a divisor addition for hyperelliptic curves. The transformation targets the Jacobian of genus-2 curves over odd characteristic fields in projective representation. Compared to previously published results, the modification reduces the computational complexity and makes hyperelliptic curves more attractive for applications.
متن کاملIndexing visual representations through the complexity map - Computer Vision, 1995. Proceedings., Fifth International Conference on
In diflerential geometry curves are characterized as mappings from an interval to the plane. In topology curves are chamcterized as a Hausdorfl space with certain countability properties. Neither of these definitions captures the role that curves play in vision, however, in which curves can denote simple objects (such as a straight line), or complicated objects (such as a jumble of string). The...
متن کاملApplications of an Isomorphism of Binary Elliptic Curves
In this paper, we discuss an isomorphism between elliptic curves defined over binary fields (curves defined over F2n). We introduce a simple public-key encryption scheme for binary elliptic curves. Here we demonstrate that this encryption scheme is as secure as the EC El Gamal cryptosystem. The basis of the encryption scheme is this isomorphism between binary elliptic curves. We use this same i...
متن کامل